Complexity of single machine scheduling problems under scenario-based uncertainty
نویسندگان
چکیده
منابع مشابه
Complexity of single machine scheduling problems under scenario-based uncertainty
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...
متن کاملOn the complexity of single machine scheduling problems under scenario - based uncertainty 1
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...
متن کاملComplexity of non-preemptive single machine scheduling problems in the presence of uncertainty
This paper deals with single machine scheduling problems where some job characteristics are uncertain. This uncertainty is described through a finite set S of well-defined scenarios. We denote by pj , d s j and w s j , respectively, the processing time, the due date and the weight of job j under scenario s ∈ S. Consider a scheduling problem, denoted by α|β|γ according to Graham et al. notation ...
متن کاملSingle machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملApproximating a two-machine flow shop scheduling under discrete scenario uncertainty
This paper deals with the two machine permutation flow shop problem with uncertain data, whose deterministic counterpart is known to be polynomially solvable. In this paper, it is assumed that job processing times are uncertain and they are specified as a discrete scenario set. For this uncertainty representation, the min-max and min-max regret criteria are adopted. The min-max regret version o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.11.005